منابع مشابه
High Concurrence Wu-Manber Multiple Patterns Matching Algorithm
Short patterns affect the performance of WuManber algorithm greatly. In order to solve this problem, an improved Wu-Manber algorithm is proposed. It divides all the patterns into different sets according to their length. For each set, independent data structures are established and different process methods are used. Because there are few resources shared among these sets, high concurrence is o...
متن کاملOptimal Shift-Or String Matching Algorithm for Multiple Patterns
In this paper, we develop a new algorithm for handling multiple patterns, which is based on average optimal shift-or algorithm. We have assumed that the pattern representation fits into a single computer word and length of each pattern is equal. We have adopted the concept of classes of characters for handling multiple patterns. We compare the performance of the proposed algorithm with the stan...
متن کاملThe Extension of The Aho-Corasick Algorithm to Multiple Rectangular Patterns of Different Sizes and N-Dimensional Patterns and Text
The p a t t e r n matching problem i s t o f i n d a l l occurrences of a p a t t e r n i n a t e x t , o r t o decide tha t no such pattern exis ts i n the text. An e f f i c ien t algorithm was proposed by Boyer and Moore [ 1 I. Unlike t h e KnuthMorris-Pratt a lgor i thm [ 2 I and the 'bruteforce' algorithm, the Boyer-Moore algorithm compares the pattern with the t ex t from the r i g h t en...
متن کاملThe Detection of Rectangular Shape Objects Using Matching Schema
Copyright ©2016 KIEEME. All rights reserved. This is an open-access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited. pISSN: 1229-7607 eISSN: 2092-7592 DOI: http://dx...
متن کاملEfficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
EEcient algorithms exist for the approximate two dimensional matching problem for rectangles. This is the problem of nding all occurrences of an m m pattern in an n n text with no more than k mismatch, insertion, and deletion errors. In computer vision it is important to generalize this problem to non-rectangular gures. We make progress towards this goal by deening half-rectangular gures of hei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1030